Orthogonal layouts using the deltahedron heuristic
نویسندگان
چکیده
,u.)-eUl''''''' and may be based on consideration of maximization of Lv~"HLVU'H"fJ chart scores or on the minimization of overall cost. We assume that all are pre;ter'able. Geometric duality that the adjacency graph be planar. context, this translates to maximal planarity, since adding further to
منابع مشابه
Computing Near-Optimal Array Cable Layouts for Offshore Wind Farms, including Cable Choice
To harvest the generated power, the turbines of an offshore wind farm are connected to an electrical transformer by cable routes. Typical cable layouts use two cable types distinguished by price and capacity: High capacity is expensive. This work presents a heuristic for computing near-optimal layouts based on the Clarke and Wright savings heuristic for vehicle routing, and the layouts it compu...
متن کاملSmooth Orthogonal Layouts
We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments and circular arcs with common tangents. Our goal is to create such layouts with low edge complexity, measured by the number of line and circul...
متن کاملThe offshore wind farm array cable layout problem: a planar open vehicle routing problem
In an offshore wind farm, the turbines are connected to a transformer by cable routes which cannot cross each other. Finding the minimum cost array cable layout thus amounts to a vehicle routing problem with the additional constraints that the routes must be embedded in the plane. For this problem, both exact and heuristic methods are of interest. We optimize cable layouts for real-world offsho...
متن کاملAn Experimental Comparison of Orthogonal Compaction Algorithms
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also ...
متن کاملEvaluation of Offset Assignment Heuristics
In digital signal processors (DSPs) variables are accessed using k address registers. The problem of finding a memory layout, for a set of variables, that minimizes the address-computation overhead is known as the General Offset Assignment (GOA) Problem. The most common approach to this problem is to partition the set of variables into k partitions and to assign each partition to an address reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 12 شماره
صفحات -
تاریخ انتشار 1995